Minimum Regret Approach to Network Management under Uncertainty with Application to Connection Admission Control and Routing
نویسنده
چکیده
This paper proposes a framework for network management intended to balance network performance under normal steady operational conditions with robustness under non-steady, and/or adverse conditions. Working in conjunction with anomaly and/or intrusion detection, the proposed framework allows the network to develop a set of measured responses to possible anomalies and external threats by minimizing the average maximum network losses, i.e., regrets or risks, due to uncertainty. Loss maximization guards against uncertainty within each scenario. Averaging of the maximum losses reflects any available information on the likelihood of different scenarios. The proposed framework includes Bayesian and minimax approaches as particular cases. The paper demonstrates how the proposed framework can alleviate high sensitivity of a cost-based admission and routing scheme to u ncertain resource costs and possible presence of excessive and/or adversarial traffic. Specific examples include competitive and minimum interference admission and routing schemes.
منابع مشابه
The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملA Regret Minimization Approach in Product Portfolio Management with respect to Customers’ Price-sensitivity
In an uncertain and competitive environment, product portfolio management (PPM) becomes more challenging for manufacturers to decide what to make and establish the most beneficial product portfolio. In this paper, a novel approach in PPM is proposed in which the environment uncertainty, competitors’ behavior and customer’s satisfaction are simultaneously considered as the most important criteri...
متن کاملA Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm
The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...
متن کاملOptimizing location, routing and inventory decisions in an integrated supply chain network under uncertainty
This study extends a mathematical model that integrates the location, allocation, inventory replenishment and routing decisions simultaneously. To cope with inherent uncertainty of parameters, we implement a continuous-time Markov process and derive the performance measures of the system. Using the obtained results, the problem is formulated as a mixed integer nonlinear programing model (MINLP)...
متن کاملAn Interactive Possibilistic Programming Approach to Designing a 3PL Supply Chain Network Under Uncertainty
The design of closed-loop supply chain networks has attracted increasing attention in recent decades with environmental concerns and commercial factors. Due to the rapid growth of knowledge and technology, the complexity of the supply chain operations is increasing daily and organizations are faced with numerous challenges and risks in their management. Most organizations with limited resources...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001